Several tasks in artificial intelligence require the ability to find models about knowledge dynamics. They include belief revision, fusion and belief merging, and abduction. In this paper, we exploit the algebraic framework of mathematical morphology in the context of propositional logic and define operations such as dilation or erosion of a set of formulas. We derive concrete operators, based on a semantic approach, that have an intuitive interpretation and that are formally well behaved, to perform revision, fusion and abduction. Computation (...) and tractability are addressed, and simple examples illustrate the main results. (shrink)

One of the main tools in the study of nonmonotonic consequence relations is the representation of such relations in terms of preferential models. In this paper we give an unified and simpler framework to obtain such representation theorems.

Let be a separable metrizable space. We establish a criteria for the existence of a metrizable globalization for a given continuous partial action of a separable metrizable group G on. If G and are Polish spaces, we show that the globalization is also a Polish space. We also show the existence of an universal globalization for partial actions of Polish groups.

Given a family${\cal C}$of infinite subsets of${\Bbb N}$, we study when there is a Borel function$S:2^{\Bbb N} \to 2^{\Bbb N} $such that for every infinite$x \in 2^{\Bbb N} $,$S\left \in {\Cal C}$and$S\left \subseteq x$. We show that the family of homogeneous sets as given by the Nash-Williams’ theorem admits such a Borel selector. However, we also show that the analogous result for Galvin’s lemma is not true by proving that there is an$F_\sigma $tall ideal on${\Bbb N}$without a Borel selector. The (...) proof is not constructive since it is based on complexity considerations. We construct a${\bf{\Pi }}_2^1 $tall ideal on${\Bbb N}$without a tall closed subset. (shrink)